Implementation of super H-antimagic total graph on establishing stream cipher
نویسندگان
چکیده
منابع مشابه
On super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملSuper (a, d)-H-antimagic total labelings for shackles of a connected graph H
A simple graph G = (V (G), E(G)) admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. An (a, d)-H-antimagic total labeling of G admitting an H-covering is a bijective function ξ : V (G) ∪ E(G) → {1, 2, . . . , |V (G)| + |E(G)|} such that for all subgraphs H ′ isomorphic to H, the H-weights w(H ′) = ∑
متن کاملOn super edge-antimagic total labelings of mKn
A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights w(uv) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a, d)-edge-antimagic total if the vertex labels are 1, 2, . . . , p. In this p...
متن کاملOn super edge-antimagic total labeling of subdivided stars
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...
متن کاملSuper (a, d)-edge antimagic total labelings of friendship graphs
An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv);uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edgeantimagic total labeling is called a sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Combinatorics
سال: 2019
ISSN: 2541-2205
DOI: 10.19184/ijc.2019.3.1.2